Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

g2(x, y) -> x
g2(x, y) -> y
f3(s1(x), y, y) -> f3(y, x, s1(x))

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

g2(x, y) -> x
g2(x, y) -> y
f3(s1(x), y, y) -> f3(y, x, s1(x))

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

F3(s1(x), y, y) -> F3(y, x, s1(x))

The TRS R consists of the following rules:

g2(x, y) -> x
g2(x, y) -> y
f3(s1(x), y, y) -> f3(y, x, s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP

Q DP problem:
The TRS P consists of the following rules:

F3(s1(x), y, y) -> F3(y, x, s1(x))

The TRS R consists of the following rules:

g2(x, y) -> x
g2(x, y) -> y
f3(s1(x), y, y) -> f3(y, x, s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.